Maximizing the strong triadic closure in split graphs and proper interval graphs
نویسندگان
چکیده
منابع مشابه
Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs
In social networks the Strong Triadic Closure is an assignment of the edges with strong or weak labels such that any two vertices that have a common neighbor with a strong edge are adjacent. The problem of maximizing the number of strong edges that satisfy the strong triadic closure was recently shown to be NP-complete for general graphs. Here we initiate the study of graph classes for which th...
متن کاملCutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
We give a linear-time algorithm to compute the cutwidth of threshold graphs, thereby resolving the computational complexity of cutwidth on this graph class. Although our algorithm is simple and intuitive, its correctness proof relies on a series of non-trivial structural results, and turns out to be surprisingly complex. Threshold graphs are a well-studied subclass of interval graphs and of spl...
متن کاملComponent Coloring of Proper Interval Graphs and Split Graphs
We introduce a generalization of the well known graph (vertex) coloring problem, which we call the problem of component coloring of graphs. Given a graph, the problem is to color the vertices using the minimum number of colors so that the size of each connected component of the subgraph induced by the vertices of the same color does not exceed C. We give a linear time algorithm for the problem ...
متن کاملMaximizing proper colorings on graphs
Article history: Received 17 November 2014 Available online xxxx
متن کاملStrong Alliances in Graphs
For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2020
ISSN: 0166-218X
DOI: 10.1016/j.dam.2020.05.035